Hitting Time and Hitting Places for Non-Lattice Recurrent Random Walks
نویسندگان
چکیده
منابع مشابه
The Hitting Time of Multiple Random Walks
This work provides generalized notions and analysis methods for the hitting time of random walks on graphs. The hitting time, also known as the Kemeny constant or the mean first passage time, of a random walk is widely studied; however, only limited work is available for the multiple random walker scenario. In this work we provide a novel method for calculating the hitting time for a single ran...
متن کاملHitting Times for Random Walks with Restarts
The time it takes a random walker in a lattice to reach the origin from another vertex x, has infinite mean. If the walker can restart the walk at x at will, then the minimum expected hitting time γ(x, 0) (minimized over restarting strategies) is finite; it was called the “grade” of x by Dumitriu, Tetali and Winkler. They showed that, in a more general setting, the grade (a variant of the “Gitt...
متن کاملQuantization of Random Walks: Search Algorithms and Hitting Time
Extended abstract Many classical search problems can be cast in the following abstract framework: Given a finite set X and a subset M ⊆ X of marked elements, detect if M is empty or not, or find an element in M if there is any. When M is not empty, a naive approach to the finding problem is to repeatedly pick a uniformly random element of X until a marked element is sampled. A more sophisticate...
متن کاملLow hitting time random walks in wireless networks
Random walks can be conveniently exploited for implementing probabilistic algorithms to solve many searching problems arised by distributed applications, e.g., service discovery, p2p file sharing, etc. In this paper we consider random walks executed on uniform wireless networks and study how to reduce the expected number of walk steps required to reach a target, namely the hitting time. The lat...
متن کاملHitting times for random walks on vertex-transitive graphs
For random walks on finite graphs, we record some equalities, inequalities and limit theorems (as the size of graph tends to infinity) which hold for vertex-transitive graphs but not for general regular graphs. The main result is a sharp condition for asymptotic exponentiality of the hitting time to a single vertex. Another result is a lower bound for the coefficient of variation of hitting tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indiana University Mathematics Journal
سال: 1967
ISSN: 0022-2518
DOI: 10.1512/iumj.1968.17.17003